Probabilistic Causes in Markov Chains

نویسندگان

چکیده

The paper studies a probabilistic notion of causes in Markov chains that relies on the counterfactuality principle and probability-raising property. This is motivated by use for monitoring purposes where aim to detect faulty or undesired behaviours before they actually occur. A cause set finite executions system after which probability effect exceeds given threshold. We introduce multiple types costs capture consump-tion resources from different perspectives, study complexity computing cost-minimal causes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic XML via Markov Chains

We show how Recursive Markov Chains (RMCs) and their restrictions can define probabilistic distributions over XML documents, and study tractability of querying over such models. We show that RMCs subsume several existing probabilistic XML models. In contrast to the latter, RMC models (i) capture probabilistic versions of XML schema languages such as DTDs, (ii) can be exponentially more succinct...

متن کامل

Empirical Bayes Estimation in Nonstationary Markov chains

Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical  Bayes estimators  for the transition probability  matrix of a finite nonstationary  Markov chain. The data are assumed to be of  a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...

متن کامل

Counterexamples in Probabilistic LTL Model Checking for Markov Chains

We propose a way of presenting and computing a counterexample in probabilistic LTL model checking for discrete-time Markov chains. In qualitative probabilistic model checking, we present a counterexample as a pair (α,γ), where α,γ are finite words such that all paths that extend α and have infinitely many occurrences of γ violate the specification. In quantitative probabilistic model checking, ...

متن کامل

Probabilistic Queuing Scheme for Servicing E- Mails Using Markov Chains

Recently, huge number of e-mails is sent and received. These e-mails are classified into spam and non spam ones which are processed with the same priority. To guarantee a higher priority service to non-spam e-mails than that is provided to spam e-mails, a two-priority queue scheme was proposed. There are some drawbacks in the two-priority queue scheme such as it fails to provide a Quality of Se...

متن کامل

Probabilistic Modeling of Academic Dishonesty via Markov Chains

Academic dishonesty is modeled via Markov chains. The case of student behavior in class assignments, quizzes and exams is analyzed in modeling examples with various levels of surveillance. The choice of modeling based on surveillance and sanctions is motivated by the research literature on the deterrence theory analysis of cheating. In addition, it is shown how surveillance and sanctions could ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-88885-5_14